Computing variance for interval data is NP-hard
نویسندگان
چکیده
منابع مشابه
Asymptotic algorithm for computing the sample variance of interval data
The problem of the sample variance computation for epistemic inter-val-valued data is, in general, NP-hard. Therefore, known efficient algorithms for computing variance require strong restrictions on admissible intervals like the no-subset property or heavy limitations on the number of possible intersections between intervals. A new asymptotic algorithm for computing the upper bound of the samp...
متن کاملComputing Standard-Deviation-to-Mean and Variance-to-Mean Ratios under Interval Uncertainty is NP-Hard
Once we have a collection of values corresponding a class of objects, a usual way to decide whether a new object with the value of the corresponding property belongs to this class is to check whether this value belongs to interval from mean E minus k sigma σ to mean plus k sigma, where the parameter k is determined by the degree of confidence with which we want to make the decision. For each va...
متن کاملComputing Exact Componentwise Bounds on Solutions of Lineary Systems with Interval Data is NP-Hard
We prove that it is NP-hard to compute the exact componentwise bounds on solutions of all the linear systems which can be obtained from a given linear system with a nonsingular matrix by perturbing all the data independently of each other within prescribed tolerances.
متن کاملLinear interval equations: Computing enclosures with bounded relative or absolute overestimation is NP-hard
"|OK|Ill|lilt), q'l'll it:lfl .'IK)('~()I'() (~ ~" 0, eCllll i'yllleCil~yer il-ll()])ll IM t" III}:IIIH4}M|III:II,III,IM BI)C:MItIIItM ll],llll|:lHellll~ "[..'II, l :ll)Kil;lll31111llll l}ellleHlll"l llflle])l~il.'lhHeH'l CIICTeMhl .'lllHel'iHl~X yp~|llHeHlll'l l' lH'll(Wlll'ellhl4llil (II;III il~CO:llOrHOfi) lllll])elllHtIcrblo, MeBhlllefl ¢~, T¢) P : NP. Pc3ydlhTiH" Cllpillle3Ullll~ TilKie 21...
متن کاملComputing a Minimum-Dilation Spanning Tree is NP-hard
Given a set S of n points in the plane, a minimumdilation spanning tree of S is a tree with vertex set S of smallest possible dilation. We show that given a set S of n points and a dilation δ > 1, it is NP-hard to determine whether a spanning tree of S with dilation at most δ exists.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGACT News
سال: 2002
ISSN: 0163-5700
DOI: 10.1145/564585.564604